On the Thinnest Coverings of Spheres and Ellipsoids with Balls in Hamming and Euclidean Spaces
نویسندگان
چکیده
In this paper, we present some new results on the thinnest coverings that can be obtained in Hamming or Euclidean spaces if spheres and ellipsoids are covered with balls of some radius ε. In particular, we tighten the bounds currently known for the ε-entropy of Hamming spheres of an arbitrary radius r. New bounds for the ε-entropy of Hamming balls are also derived. If both parameters ε and r are linear in dimension n, then the upper bounds exceed the lower ones by an additive term of order log n. We also present the uniform bounds valid for all values of ε and r. In the second part of the paper, new sufficient conditions are obtained, which allow one to verify the validity of the asymptotic formula for the size of an ellipsoid in a Hamming space. Finally, we survey recent results concerning coverings of ellipsoids in Hamming and Euclidean spaces.
منابع مشابه
On the Thinnest Coverings of Spheres and Ellipsoids with Balls in on the Thinnest Coverings of Spheres and Ellipsoids
In this paper, we present some new results on the thinnest coverings that can be obtained in Hamming or Euclidean spaces if spheres and ellipsoids are covered with balls of some radius ε. In particular, we tighten the bounds currently known for the ε-entropy of Hamming spheres of an arbitrary radius r. New bounds for the ε-entropy of Hamming balls are also derived. If both parameters ε and r ar...
متن کاملCovering an ellipsoid with equal balls
The thinnest coverings of ellipsoids are studied in the Euclidean spaces of an arbitrary dimension n. Given any ellipsoid, our goal is to find the minimum number of unit balls needed to cover this ellipsoid. A tight asymptotic bound on the logarithm of this number is obtained. © 2006 Elsevier Inc. All rights reserved.
متن کاملEllipsoidal lists and maximum-likelihood decoding
We study an interrelation between the coverings generated by linear ( )–codes and complexity of their maximum-likelihood (ML) decoding. First, discrete ellipsoids in the Hamming spaces are introduced. These ellipsoids represent the sets of most probable error patterns that need to be tested in soft-decision ML decoding. We show that long linear ( )-codes surrounded by ellipsoids of exponential ...
متن کاملCovering and Packing with Spheres
We address the problem of covering R with congruent balls, while minimizing the number of balls that contain an average point. Considering the 1-parameter family of lattices defined by stretching or compressing the integer grid in diagonal direction, we give a closed formula for the covering density that depends on the distortion parameter. We observe that our family contains the thinnest latti...
متن کاملOn Homogeneous Coverings of Euclidean Spaces
The notion of a homogeneous covering of a given set is introduced and examined. Some homogeneous coverings of a Euclidean space, consisting of pairwise congruent geometric figures (spheres, hyperplanes, etc.), are constructed using the method of transfinite induction. 2000 Mathematics Subject Classification: 03E75, 05B40, 52C17.
متن کامل